Theoretical Computer Science Ws 2017
نویسنده
چکیده
Detailed information on the material covered during the semester, including relevant references to the literature, will be regularly given here. Our two main textbooks are listed below. Both of those textbooks are available for free download via the University of Vienna Library. The book of Herbert Enderton, Computability theory. An introduction to recursion theory , gives a detailed introduction to the subject of recursion theory and will be used in the beginning of the course. The book of Sanjeev Arora and Boaz Barak, Computational complexity. A Modern Approach, gives a comprehensive account of many interesting topics in computational complexity. Another excellent source is [3].
منابع مشابه
Model Checking Techniques applied to the design of Web Services
In previous work we have presented the generation of WS-CDL and WS-BPEL documents. In this paper we show the unification of both generations. The aim is to generate correct WS-BPEL skeleton documents from WS-CDL documents by using the Timed Automata as an intermediary model in order to check the correctness of the generated Web Services with Model Checking Techniques. The model checker used is ...
متن کاملTight Euler tours in uniform hypergraphs - computational aspects
By a tight tour in a k-uniform hypergraph H we mean any sequence of its vertices (w0, w1, . . . , ws−1) such that for all i = 0, . . . , s−1 the set ei = {wi, wi+1 . . . , wi+k−1} is an edge ofH (where operations on indices are computed modulo s) and the sets ei for i = 0, . . . , s − 1 are pairwise different. A tight tour in H is a tight Euler tour if it contains all edges ofH . We prove that ...
متن کاملA procedure for Web Service Selection Using WS-Policy Semantic Matching
In general, Policy-based approaches play an important role in the management of web services, for instance, in the choice of semantic web service and quality of services (QoS) in particular. The present research work illustrates a procedure for the web service selection among functionality similar web services based on WS-Policy semantic matching. In this study, the procedure of WS-Policy publi...
متن کاملWhat Drives People's Choices in Turn-Taking Games, if not Game-Theoretic Rationality?
Citation for published version (APA): Ghosh, S., Heifetz, A., Verbrugge, R., & Weerd, H. D. (2017). What Drives People's Choices in TurnTaking Games, if not Game-Theoretic Rationality? In J. Lang (Ed.), Proceedings 6th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2017), Liverpool, U.K.: Proceedings (pp. 265284). (Electronic Proceedings in Theoretical Computer Science (EP...
متن کاملTheoretical Computer Science for the Working Category Theorist
Theoretical computer science discusses foundational issues about computations. It asks and answers questions such as “What is a computation?”, “What is computable?”, “What is efficiently computable?”,“What is information?”, “What is random?”, “What is an algorithm?”, etc. We will present many of the major themes and theorems with the basic language of category theory. Surprisingly, many interes...
متن کامل